Modeling reformulation using query distributions
نویسندگان
چکیده
منابع مشابه
Modeling Reformulation Using Query Distributions
Query reformulation modifies the original query with the aim of better matching the vocabulary of the relevant documents, and consequently improving ranking effectiveness. Previous models typically generate words and phrases related to the original query, but do not consider how these words and phrases would fit together in new queries. In this paper, a novel framework is proposed that models r...
متن کاملUsing Ontologies for Database Query Reformulation
Query reformulation techniques based on semantic knowledge have been used in two ways in database management systems, namely for query optimization and for data integration. For the former approach, the main goal of query reformulation is to rewrite a user query into another one that uses less time and/or less resources during the execution. The main goal of the latter approach is to translate ...
متن کاملOntology Based Query Reformulation using Rhetorical Relations
Web searching is becoming more and more complex due to increased size of information on the web. Users have to face a lot of problems in specifying their needs in the form of query. Query Reformulation techniques are required in order to provide users with the results, according to their expectations. The existing reformulation techniques suffer from the problem of not providing users with expe...
متن کاملUsing Association Rules for Query Reformulation
In this paper the authors will present research on the combination of two methods of data mining: text classification and maximal association rules. Text classification has been the focus of interest of many researchers for a long time. However, the results take the form of lists of words (classes) that people often do not know what to do with. The use of maximal association rules induced a num...
متن کاملPseudo-Query Reformulation
Automatic query reformulation refers to rewriting a user’s original query in order to improve the ranking of retrieval results compared to the original query. We present a general framework for automatic query reformulation based on discrete optimization. Our approach, referred to as pseudoquery reformulation, treats automatic query reformulation as a search problem over the graph of unweighted...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Information Systems
سال: 2013
ISSN: 1046-8188,1558-2868
DOI: 10.1145/2457465.2457466